On the computation of integrals over fixed-size rectangles of arbitrary dimension

نویسندگان

  • Omar Ocegueda
  • Oscar Dalmau Cedeño
  • Eleftherios Garyfallidis
  • Maxime Descoteaux
  • Mariano Rivera
چکیده

We present a formula for computing integrals over rectangles of arbitrary dimension in the special case that the size of the rectangles of interest is constant. Compared to the popular method of integral images, our approach reduces the amount of auxiliary memory and alleviates the effect of precision loss when computing large integral images. As an application of this technique we present a fast implementation of the Normalized Cross Correlation (NCC) metric for deformable image registration and test it with the popular Symmetric Normalization (SyN) registration algorithm dramatically reducing the computational cost in terms of both time and temporary memory. © 2016 Elsevier B.V. All rights reserved. c n v e A s e e x r l T c v

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

استفاده از روش غنی شده بدون شبکه گلرکین در تعیین پارامتر های شکست صفحات FGM

Stress-intensity factors (SIFs) are the most important parameters in fracture mechanics analysis of structures. These parameters are evaluated for a stationary crack in functionally graded plates of arbitrary geometry using a novel Galerkin based mesh-free method. The method involves an element-free Galerkin method (EFGM), where the material properties are smooth functions of spatial coordinate...

متن کامل

A new metaheuristic genetic-based placement algorithm for 2D strip packing

Given a container of fixed width, infinite height and a set of rectangular block, the 2D-strip packing problem consists of orthogonally placing all the rectangles such that the height is minimized. The position is subject to confinement of no overlapping of blocks. The problem is a complex NP-hard combinatorial optimization, thus a heuristic based on genetic algorithm is proposed to solve it. I...

متن کامل

In-Place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs

In this paper, we study the problem of designing in-place algorithms for finding the maximum clique in the intersection graphs of axis-parallel rectangles and disks in R2. First, we propose an O(n2 log n) time in-place algorithm for finding the maximum clique of the intersection graph of a set of n axis-parallel rectangles of arbitrary sizes. For the intersection graph of fixed height rectangle...

متن کامل

Projectors, Shadows, and Conformal Blocks

We introduce a method for computing conformal blocks of operators in arbitrary Lorentz representations in any spacetime dimension, making it possible to apply bootstrap techniques to operators with spin. The key idea is to implement the “shadow formalism” of Ferrara, Gatto, Grillo, and Parisi in a setting where conformal invariance is manifest. Conformal blocks in d-dimensions can be expressed ...

متن کامل

Integration of Trivariate Polynomials over Linear Polyhedra in Euclidean Three-dimensional Space

This paper concerns with analytical integration of trivariate polynomials over linear polyhedra in Euclidean three-dimensional space. The volume integration of trivariate polynomials over linear polyhedra is computed as sum of surface integrals in R3 on application of the well known Gauss’s divergence theorem and by using triangulation of the linear polyhedral boundary. The surface integrals in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Pattern Recognition Letters

دوره 79  شماره 

صفحات  -

تاریخ انتشار 2016